A Disproof of a Conjecture of Erdos in Ramsey Theory
نویسنده
چکیده
Denote by kt(G) the number of complete subgraphs of order f in the graph G. Let where G denotes the complement of G and \G\ the number of vertices. A well-known conjecture of Erdos, related to Ramsey's theorem, is that Mmn^K ct(ri) = 2 ~*. This latter number is the proportion of monochromatic Kt's in a random colouring of Kn. We present counterexamples to this conjecture and discuss properties of the extremal graphs.
منابع مشابه
Probabilistic Methods on Erdos Problems
There are four parts: an introduction, a set of solutions to the Ramsey problem, some enumeration problems, and the Gyarfas-Lehel conjecture. Section
متن کاملOn a conjecture of erdöus, simonovits, and sós concerning anti-Ramsey theorems
For n 2 k 2 3, let f(n,Ck) denote the maximum number rn for which it is possible to color the edges of the complete graph K" with rn colors in such a way that each k-cycle Ck in K" has a t least two edges of the same color. Erdos, Simonovits, and Sos conjectured that for every fixed k 2 3, k-2 1 f(n, Ck) = n (T +-) + O (1), k-1 and proved it only for k = 3. It is shown that f(n,C4) = n-t [Em]-1...
متن کاملErdos Distance Problem in Vector Spaces over Finite Fields
The classical Erdos distance conjecture says that the number of distance determined by N points in Rd, d ≥ 2, is at least CN 2 d − . We shall discuss this problem in vector spaces over finite fields where some interesting number theory comes into play. A connection with the continuous analog of the Erdos distance conjecture, the Falconer distance conjecture will be also be established. Universi...
متن کاملThe Ramsey number of a graph with bounded maximum degree
The Ramsey number of a graph G is the least number t for which it is true that whenever the edges of the complete graph on t vertices are colored in an arbitrary fashion using two colors, say red and blue, then it is always the case that either the red subgraph contains G or the blue subgraph contains G. A conjecture of P. Erdos and S. Burr is settled in the afftrmative by proving that for each...
متن کاملErdos Conjecture I
An old conjecture of Paul Erdos [6] states that there exist only 7 integers A. = 4,7,15.21,45,75 and 105 such that the difference A 28 is a prime for all B for which it is at least two. It is known that the conjecture is true for all A < 277 , as Cchiyama and Yorinaga have verified in 1977 ([21]), and in this short paper I show how it is related to other famous unsolved problems in prime number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989